The minimum spanning tree problem on a planar graph

The Minimum Spanning Tree Problem on a Planar Graph

Finding a spanning tree of minimum weight is one of the best known graph problems. a liner time algorithm for the minimum spanning tree problem on a planar graph. In [1], Cheriton and Tarjan have proposed a linear time algorithm for this problem. The time complexity of our algorithm is the same as that of Cheriton and Tarjan's algorithm. Dierent from Cheriton and Tarjan's algorithm, our algorit...

A Linear Time Algorithm for the Minimum Spanning Tree Problem on a Planar Graph

In this paper, we propose a linear time algorithm for nding a minimum spanning tree on a planar graph.

A Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem

The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...

On the Minimum Label Spanning Tree Problem

On the Minimum Diameter Spanning Tree Problem

We point out a relation between the minimum diameter spanning tree of a graph and its absolute 1-center. We use this relation to solve the diameter problem and an extension of it eeciently.